Boundaries of Markov Partitions

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Markov Partitions and Homoclinic Pointsof

We prove that a general class of expansive Z d-actions by automorphisms of compact, abelian groups with completely positive en-tropy has`symbolic covers' of equal topological entropy. These symbolic covers are constructed by using homoclinic points of these actions. For d = 1 we adapt a result of Kenyon and Vershik in 7] to prove that these symbolic covers are, in fact, sooc shifts. For d 2 we ...

متن کامل

Symbolic Dynamics and Markov Partitions

The decimal expansion of real numbers, familiar to us all, has a dramatic generalization to representation of dynamical system orbits by symbolic sequences. The natural way to associate a symbolic sequence with an orbit is to track its history through a partition. But in order to get a useful symbolism, one needs to construct a partition with special properties. In this work we develop a genera...

متن کامل

Markov Partitions and Feigenbaum-like Mappings

We construct a Markov partition for a Feigenbaum-like mapping. We prove that this Markov partition has bounded nearby geometry property similar to that for a geometrically finite one-dimensional mappings [8]. Using this property, we give a simple proof that any two Feigenbaum-like mappings are topologically conjugate and the conjugacy is quasisymmetric.

متن کامل

Reversible Markov structures on divisible set partitions

We study k-divisible partition structures, which are families of random set partitions whose block sizes are divisible by an integer k = 1, 2, . . .. In this setting, exchangeability corresponds to the usual invariance under relabeling by arbitrary permutations; however, for k > 1, the ordinary deletion maps on partitions no longer preserve divisibility, and so a random deletion procedure is ne...

متن کامل

Algorithms for discovery of multiple Markov boundaries

Algorithms for Markov boundary discovery from data constitute an important recent development in machine learning, primarily because they offer a principled solution to the variable/feature selection problem and give insight on local causal structure. Over the last decade many sound algorithms have been proposed to identify a single Markov boundary of the response variable. Even though faithful...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the American Mathematical Society

سال: 1992

ISSN: 0002-9947

DOI: 10.2307/2154105